Explaining and Suggesting Relatedness in Knowledge Graphs
نویسنده
چکیده
Abstract. Knowledge graphs (KGs) are a key ingredient for searching, browsing and knowledge discovery activities. Motivated by the need to harness knowledge available in a variety of KGs, we face the following two problems. First, given a pair of entities defined in some KG, find an explanation of their relatedness. We formalize the notion of relatedness explanation and introduce different criteria to build explanations based on information-theory, diversity and their combinations. Second, given a pair of entities, find other (pairs of) entities sharing a similar relatedness perspective. We describe an implementation of our ideas in a tool, called RECAP, which is based on RDF and SPARQL. We provide an evaluation of RECAP and a comparison with related systems on real-world data.
منابع مشابه
Explaining and Querying Knowledge Graphs by Relatedness
We demonstrate RECAP, a tool that explains relatedness between entities in Knowledge Graphs (KGs) and implements a query by relatedness paradigm that allows to retrieve entities related to those in input. One of the peculiarities of RECAP is that it does not require any data preprocessing and can combine knowledge from multiple KGs. The underlying algorithmic techniques are reduced to the execu...
متن کاملBabelRelate! A Joint Multilingual Approach to Computing Semantic Relatedness
We present a knowledge-rich approach to computing semantic relatedness which exploits the joint contribution of different languages. Our approach is based on the lexicon and semantic knowledge of a wide-coverage multilingual knowledge base, which is used to compute semantic graphs in a variety of languages. Complementary information from these graphs is then combined to produce a ‘core’ graph w...
متن کاملAn Algorithm for Combining Graphs Based on Shared Knowledge
We propose an algorithm for connecting nodes from multiple disconnected graphs based on a given tuple set representing shared knowledge. The set of tuples is used to create bridgeedges for combining two graphs. The path from a node in a graph to a node in the other graph passes through a bridgeedge. This method of combining two graphs will enable more comprehensive understanding and exploring o...
متن کاملLeveraging Deep Neural Networks and Knowledge Graphs for Entity Disambiguation
Entity Disambiguation aims to link mentions of ambiguous entities to a knowledge base (e.g., Wikipedia). Modeling topical coherence is crucial for this task based on the assumption that information from the same semantic context tends to belong to the same topic. This paper presents a novel deep semantic relatedness model (DSRM) based on deep neural networks (DNN) and semantic knowledge graphs ...
متن کاملExplaining Practical Knowledge (Skills and Activities) of Teacher Educator based on Competencie’s Reflective Practice
The present research was conducted with the aim of explaining the practical knowledge (skills and activities) of teacher training teacher based on the skillfulness of action. The first step was to investigate the history of teacher training teachers and their global studies in accordance with the combined research methodology: Total Synthesis The text of the documents and handwritten writings o...
متن کامل